Linear-time geometric algorithm for evaluating B\'ezier curves
نویسنده
چکیده
New algorithm for evaluating a point on a Bézier curve and on a rational Bézier curve is given. The method has a geometric interpretation and a convex hull property. The computational complexity of the new algorithm is linear with respect to the degree of the considered curve, and its memory complexity is O(1).
منابع مشابه
AN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملA representation for some groups, a geometric approach
In the present paper, we are going to use geometric and topological concepts, entities and properties of the integral curves of linear vector fields, and the theory of differential equations, to establish a representation for some groups on $R^{n} (ngeq 1)$. Among other things, we investigate the surjectivity and faithfulness of the representation. At the end, we give some app...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملApplications of fast triangulation simplification
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors. In its simplest instances, this algorithm works by finding the minimal position of the two curves. We achieve this by phrasing the problem as a collection of...
متن کاملMeasure of Circularity for Digital Curves and its Fast Computation
This paper focuses on the design of an effective method that computes the measure of circularity of an open or closed digital curve. Thanks to its geometric interpretation, an algorithm that only uses classical tools of computational geometry is derived. Even if a sophisticated machinery coming from linear programming can provide a linear time algorithm, its O(n log n) time complexity is better...
متن کامل